1665A - GCD vs LCM - CodeForces Solution


constructive algorithms math

Please click on ads to support us..

Python Code:

t=int(input())
while(t>0):
    n=int(input())
    if(n%2==0):
        if(n%4==0):
            print(n//4,n//4,n//4,n//4)
        else:
            print(((n-2)//2)-1,((n-2)//2)+1,1,1)
    else:
        print((n-2)//2,((n-2)//2)+1,1,1)


    t=t-1
    

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double

int32_t main(){
    
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

int t;
cin>>t;
while(t--)
{
    int n;
    cin>>n;
    if(n==4)
    {
        cout<<1<<" "<<1<<" "<<1<<" "<<1<<endl;
        continue;
    }
    if(n==6)
    {
        cout<<3<<" "<<1<<" "<<1<<" "<<1<<endl;
        continue;
    }
    if(n%2==1)
    {
        n-=2;
        int s1=n/2;
        int s2=n-s1;
        cout<<s1<<" "<<s2<<" "<<1<<" "<<1<<endl;


    }
    else
    {
        n-=4;
        int s2=n-2;
        cout<<2<<" "<<s2<<" "<<2<<" "<<2<<endl;
    }

}

return 0;
}


Comments

Submit
0 Comments
More Questions

115A - Party
746B - Decoding
1424G - Years
1663A - Who Tested
1073B - Vasya and Books
195B - After Training
455A - Boredom
1099A - Snowball
1651D - Nearest Excluded Points
599A - Patrick and Shopping
237A - Free Cash
1615B - And It's Non-Zero
1619E - MEX and Increments
34B - Sale
1436A - Reorder
1363C - Game On Leaves
1373C - Pluses and Minuses
1173B - Nauuo and Chess
318B - Strings of Power
1625A - Ancient Civilization
864A - Fair Game
1663B - Mike's Sequence
448A - Rewards
1622A - Construct a Rectangle
1620A - Equal or Not Equal
1517A - Sum of 2050
620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits